finite universe - Übersetzung nach russisch
Diclib.com
Wörterbuch ChatGPT
Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:     

Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT

Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:

  • wie das Wort verwendet wird
  • Häufigkeit der Nutzung
  • es wird häufiger in mündlicher oder schriftlicher Rede verwendet
  • Wortübersetzungsoptionen
  • Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
  • Etymologie

finite universe - Übersetzung nach russisch

COVER OF A SET
Point finite; Point-finite; Point finite collection

finite universe      

математика

конечная совокупность

constructible universe         
PARTICULAR CLASS OF SETS WHICH CAN BE DESCRIBED ENTIRELY IN TERMS OF SIMPLER SETS
Goedel's constructible universe; Gödel constructible universe; Gödel's constructible universe; Goedel constructibility; Goedel constructible; Goedel constructible universe; Gödel constructible; Gödel constructibility; Godel's universe; Goedel's universe; Goedels universe; Godels universe; L (set theory); Constructible subset; Godel constructible universe; Godel's constructible universe; Goedel universe; Godel constructibility; Godel constructible; Gödel constructive set; Constructible hierarchy; Set-theoretic constructibility; Gödel's L

математика

конструктивный универсум

accepting state         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

математика

поглощающее состояние

Wikipedia

Point-finite collection

In mathematics, a collection or family U {\displaystyle {\mathcal {U}}} of subsets of a topological space X {\displaystyle X} is said to be point-finite if every point of X {\displaystyle X} lies in only finitely many members of U . {\displaystyle {\mathcal {U}}.}

A metacompact space is a topological space in which every open cover admits a point-finite open refinement. Every locally finite collection of subsets of a topological space is also point-finite. A topological space in which every open cover admits a locally finite open refinement is called a paracompact space. Every paracompact space is therefore metacompact.

Übersetzung von &#39finite universe&#39 in Russisch